A Novel Protein Soft Docking Algorithm Based on Spectral Analysis of Shape Complementarity
نویسندگان
چکیده
We describe a novel method for predicting protein docking conformations using spectral analysis techniques. Rigid-body docking methods based on shape complementarity, particularly Fourier transform based techniques are successful for docking monomers with conformations adopted at binding (complexed conformations) [4]. This approach is very efficient because a complete search over all six degrees of freedom can be performed by simple rotation and translation operations. However, when docking unbound conformations, the method generally yields many false positive structures. Several rigid-body methods have been developed to overcome this problem [1, 2, 3, 5, 6]. Mandell et al. employed an energy term consisting of both the sum of Poisson-Bolzmann electrostatic and van der Waals energies [5]. Palma et al. introduced the concept of soft-surface rigid-body docking introducing molecular flexibility in the rigid-body algorithm. Amongst the protein complexes observed, ARG, LYS, ASP, GLU and MET present the highest frequency and amplitude of movements between the structures of free and co-crystallized proteins. So these amino acids are considered flexible and are allowed to unrealistically penetrate the other molecule during the docking search. The “soft-surface” representation is achieved by simply setting a 0 in the core matrix cells assigned to the side chain atoms of these five amino acid types [6]. Here, we propose a genuine soft docking algorithm that uses spectral analysis for handling shape complementrarity in a more ample way without constraining side chains by type of amino acid. This algorithm extracts a characteristic shape from the unbound conformation by applying a three dimensional filter. The high flexibility of the amino acids on the molecular surface is averaged and thus the filtering introduces “softness” in the algorithm. The softened shapes prevent unrealistic penetrations into one another of the molecules during the docking search process. The algorithm has been implemented as a module within the system for macromolecular interaction assessment MIAX[2], the results outperforming those of flexible docking both in MIAX and as compared to other similar systems.
منابع مشابه
A novel shape complementarity scoring function for protein-protein docking.
Shape complementarity is the most basic ingredient of the scoring functions for protein-protein docking. Most grid-based docking algorithms use the total number of grid points at the binding interface to quantify shape complementarity. We have developed a novel Pairwise Shape Complementarity (PSC) function that is conceptually simple and rapid to compute. The favorable component of PSC is the t...
متن کاملDocking unbound proteins with MIAX: a novel algorithm for protein-protein soft docking.
We propose a new methodology for "soft'' docking unbound protein molecules (reported at the isolated state). The methodology is characterized by its simplicity and easiness of embedment in any rigid body docking process based on point complementarity. It is oriented to allow limited free but not unrealistic interpenetration of the side chains of protein surface amino acid residues. The central ...
متن کاملExamination of Shape
Here we carry out an examination of shape complementarity as a criterion in protein{protein docking and binding. Speci cally, we examine the quality of shape complementarity as a critical determinant not only in the docking of 26 protein{protein \bound", complexed cases, but in particular, of 19 \unbound" protein{protein cases, where the structures have been determined separately. In all cases,...
متن کاملExamination of shape complementarity in docking of unbound proteins.
Here we carry out an examination of shape complementarity as a criterion in protein-protein docking and binding. Specifically, we examine the quality of shape complementarity as a critical determinant not only in the docking of 26 protein-protein "bound" complexed cases, but in particular, of 19 "unbound" protein-protein cases, where the structures have been determined separately. In all cases,...
متن کاملA Combinatorial Shape Matching Algorithm for Rigid Protein Docking
The protein docking problem is to predict the structure of protein-protein complexes from the structures of individual proteins. It is believed that shape complementarity plays a dominant role in protein docking. Recently, it has been shown empirically by Bespamaytnikh et al [4] that the shape complementarity (measured by a score function) is sufficient for the bound protein docking problem, in...
متن کامل